Shallow Finite State Verification
نویسندگان
چکیده
We consider the problem of verifying finite state properties of shallow programs; i.e., programs where pointers from program variables to heap-allocated objects are allowed, but where heap-allocated objects may not themselves contain pointers. We prove a number of results relating the complexity of such verification problems to the nature of the finite state machine used to specify the property. Some properties are shown to be intractable, but others which appear to be quite similar admit polynomial-time verification algorithms. While there has been much progress on many aspects of automated program verification, we are not aware of any previous work relating the difficulty of finite state verification to properties of the finite state automaton. Our results serve to provide insight into the inherent complexity of important classes of verification problems. In addition, the program abstractions used for the polynomial-time verification algorithms may be of independent interest.
منابع مشابه
Typestate Verification: Abstraction Techniques and Complexity Results
We consider the problem of typestate verification for shallow programs; i.e., programs where pointers from program variables to heap-allocated objects are allowed, but where heap-allocated objects may not themselves contain pointers. We prove a number of results relating the complexity of verification to the nature of the finite state machine used to specify the property. Some properties are sh...
متن کاملComparing and Combining Finite-State and Context-Free Parsers
In this paper, we look at comparing highaccuracy context-free parsers with highaccuracy finite-state (shallow) parsers on several shallow parsing tasks. We show that previously reported comparisons greatly under-estimated the performance of context-free parsers for these tasks. We also demonstrate that contextfree parsers can train effectively on relatively little training data, and are more ro...
متن کاملOptimal Control of a Finite-Element Limited-Area Shallow-Water Equations Model
Abstract Optimal control of a finite element limited-area shallow water equations model is explored with a view to apply variational data assimilation(VDA) by obtaining the minimum of a functional estimating the discrepancy between the model solutions and distributed observations. In our application, some simplified hypotheses are used, namely the error of the model is neglected, only the initi...
متن کاملExperimental and Numerical Modeling of the Effect of Groundwater Table Lowering on Bearing Capacity of Shallow Square Footings
The lowering of the groundwater table causes the area above the water table to become unsaturated and capillary phenomena to appear in this zone. This means that the bearing capacity of shallow footings will be influenced by capillary stress or matric suction. In this research, the effect of groundwater table lowering on the bearing capacity of a shallow square model footing on dense sand has b...
متن کاملPartial Unfolding for Compositional Nonblocking Verification of Extended Finite-state Machines
This working paper describes a framework for compositional nonblocking verification of reactive systems modelled as extended finite-state machines. The nonblocking property can capture the absence of livelocks and deadlocks in concurrent systems. Compositional verification is shown in previous work to be effective to verify this property for large discrete event systems. Here, these results are...
متن کامل